Complete graph - PDFSEARCH.IO - Document Search Engine

Complete graph
Results: 868

#	Item
421	Maximizing Social Influence in Nearly Optimal Time Christian Borgs∗ Michael Brautbar† Jennifer Chayes‡ Add to Reading List Source URL: arxiv.org Language: English - Date: 2013-09-22 20:59:44 NP-complete problems Hypergraph Submodular set function Bridge Graph partition Network theory Networks Belief propagation Randomized algorithm Graph theory Theoretical computer science Mathematics
422	The Complexity of Degree Anonymization by Vertex Addition Robert Bredereck? , Vincent Froese?? , Sepp Hartung, Andr´e Nichterlein, Rolf Niedermeier, and Nimrod Talmon? ? ? Institut f¨ ur Softwaretechnik und Theoretisch Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2014-04-17 07:44:41 NP-complete problems Degree Tree Independent set Clique Connectivity Vertex Graph Neighbourhood Graph theory Theoretical computer science Mathematics
423	AN ALGORITHM FOR DETECTING INTRINSICALLY KNOTTED GRAPHS arXiv:1109.1030v2 [math.GT] 9 OctJONATHAN MILLER AND RAMIN NAIMI Add to Reading List Source URL: arxiv.org Language: English - Date: 2013-10-09 21:48:19 Linkless embedding Graph embedding Robertson–Seymour theorem Minor Chordal graph Complete graph Petersen family Planar graphs Graph theory Topological graph theory Knot theory
424	A 2.5 Factor Approximation Algorithm for the k-MST Problem Sunil Arya∗ H. Ramesh† Add to Reading List Source URL: www.cse.ust.hk Language: English - Date: 2006-04-04 10:31:23 NP-complete problems Spanning tree Network theory Minimum spanning tree Shortest path problem Tree Graph Approximation algorithm Steiner tree problem Theoretical computer science Graph theory Mathematics
425	IEEE/ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS, VOL. XX, NO. X, JANUARY 201X 1 Partitioning Biological Networks into Highly Connected Clusters Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2014-01-08 11:56:00 NP-complete problems Degeneracy Vertex cover Kernelization Neighbourhood Clique Graph operations Connectivity Tree Graph theory Mathematics Theoretical computer science
426	Microsoft PowerPoint - K-Anonymity.ppt Add to Reading List Source URL: www.andrew.cmu.edu Language: English - Date: 2012-08-22 17:30:01 NP-complete problems Graph partition Graph Matching Hypergraph Domatic number Graph theory Theoretical computer science Mathematics
427	Approximating k-center in planar graphs David Eisenstat∗ Philip N. Klein∗ Abstract Add to Reading List Source URL: www.di.ens.fr Language: English - Date: 2013-10-10 10:36:31 NP-complete problems Graph operations Dominating set Neighbourhood Tree decomposition Tree Planar graph Graph Degree Graph theory Mathematics Theoretical computer science
428	Algorithms CS 6820 Fall 2009 Problem Set 5 Due November 11, 2009 Add to Reading List Source URL: www.cs.cornell.edu Language: English - Date: 2009-10-30 17:40:59 Graph operations Connectivity Tree decomposition Graph Travelling salesman problem Tree Line graph Chordal graph Graph theory NP-complete problems Graph coloring
429	Graph Pricing Problem on Bounded Treewidth, Bounded Genus and k-Partite Graphs Add to Reading List Source URL: cjtcs.cs.uchicago.edu Language: English - Date: 2013-11-08 11:23:34 NP-complete problems Graph operations Tree decomposition Vertex cover Minor Planar graph Dynamic programming Path decomposition Apex graph Graph theory Theoretical computer science Mathematics
430	LNCSA Continuous-Based Approach for Partial Clique Enumeration Add to Reading List Source URL: www.dsi.unive.it Language: English - Date: 2010-08-27 12:12:13 NP-complete problems Graph operations Clique problem Clique Independent set Matching Networks Maximal independent set Cograph Graph theory Theoretical computer science Mathematics

UPDATE